#include <gtest/gtest.h>

#include <cmath>
#include <iostream>

#include "algorithm/recursion/include/power_n.h"
TEST(POWERN, BaseTest) {
  const int N = 10;
  int result[N] = {0, 1, 1, 2, 3, 5, 8, 13, 21, 34};
  for (int i = 0; i < 10; i++) {
    std::cerr << "My = " << power_n(result[i], 4)
              << " std = " << std::pow(result[i], 4) << "\n";
    ASSERT_EQ(power_n(result[i], 4), std::pow(result[i], 4));
  }
}
